Minimizing Schedule Length or Makespan Criteria for Parallel Processor
نویسنده
چکیده
s : Our motivation is to answer some open problems in parallel scheduling problems. We consider problems that are NP-hard. A standard way of dealing with NP-hard problems is not to search for an optimal solution, but to go for near-optimal solutions in a polynomial time approximation algorithm. In this paper, we summarize what is known on minimizing schedule length or makespan criteria for parallel processor scheduling problems. From a recent paper of Schuurman and Woeginger (1999), we relate four open problems on such algorithms.
منابع مشابه
Parallel Processor Scheduling with Limited Number of Preemptions
In this paper, we compare the makespan of preemptive and i-preemptive schedules where only a limited number i of preemptions is allowed. The problem is to schedule n independent jobs on m identical processors that operate in parallel. The objective is to minimize the makespan, i.e., the completion time of the last job that finishes. We show that the ratio of the optimal ipreemptive schedule len...
متن کاملA Mathematical Model for a Flow Shop Scheduling Problem with Fuzzy Processing Times
This paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. In the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). However,, two significant criteria for each schedule in stochastic models are: expectable m...
متن کاملScheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation
In the last few years, multi-processor scheduling with interprocessor communication delays has received increasing attention. This is due to the more realistic constraints in modeling parallel processor systems. Most research in this vein is concerned with the makespan criterion. We contribute to this work by presenting a new and simple ( 2 1)-approximation algorithm for scheduling to minimize ...
متن کاملScheduling for Large-Scale Systems
In this chapter, scheduling is defined as the activity that consists in mapping a task graph onto a target platform. The task graph represents the application, nodes denote computational tasks, and edges model precedence constraints between tasks. For each task, an assignment (choose the processor that will execute the task) and a schedule (decide when to start the execution) are determined. Th...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008